On The Equality Of The Grundy Numbers Of A Graph
نویسندگان
چکیده
Our work becomes integrated into the general problem of the stability of the network ad hoc. Some, works attacked(affected) this problem. Among these works, we find the modelling of the network ad hoc in the form of a graph. Thus the problem of stability of the network ad hoc which corresponds to a problem of allocation of frequency amounts to a problem of allocation of colors in the vertex of graph. we present use a parameter of coloring " the number of Grundy”. The Grundy number of a graph G, denoted by Γ(G), is the largest k such that G has a greedy k-coloring, that is a coloring with colours obtained by applying the greedy algorithm according to some ordering of the vertices of G. In this paper, we study the Grundy number of the lexicographic, Cartesian and direct products of two graphs in terms of the Grundy numbers of these graphs.
منابع مشابه
A characterization of trees with equal Roman 2-domination and Roman domination numbers
Given a graph $G=(V,E)$ and a vertex $v in V$, by $N(v)$ we represent the open neighbourhood of $v$. Let $f:Vrightarrow {0,1,2}$ be a function on $G$. The weight of $f$ is $omega(f)=sum_{vin V}f(v)$ and let $V_i={vin V colon f(v)=i}$, for $i=0,1,2$. The function $f$ is said to bebegin{itemize}item a Roman ${2}$-dominating function, if for every vertex $vin V_0$, $sum_{uin N(v)}f(u)geq 2$. The R...
متن کاملA linear algorithm for the grundy number of a tree
A coloring of a graph G = (V ,E) is a partition {V1, V2, . . . , Vk} of V into independent sets or color classes. A vertex v ∈ Vi is a Grundy vertex if it is adjacent to at least one vertex in each color class Vj for every j <i. A coloring is a Grundy coloring if every color class contains at least one Grundy vertex, and the Grundy number of a graph is the maximum number of colors in a Grundy c...
متن کاملOn the equality of the partial Grundy and upper ochromatic numbers of graphs
A (proper) k-coloring of agraph G is a partition = {V1; V2; : : : ; Vk} of V (G) into k independent sets, called color classes. In a k-coloring , a vertex v∈Vi is called a Grundy vertex if v is adjacent to at least one vertex in color class Vj , for every j, j¡ i. A k-coloring is called a Grundy coloring if every vertex is a Grundy vertex. A k-coloring is called a partial Grundy coloring if eve...
متن کاملOn the edge geodetic and edge geodetic domination numbers of a graph
In this paper, we study both concepts of geodetic dominatingand edge geodetic dominating sets and derive some tight upper bounds onthe edge geodetic and the edge geodetic domination numbers. We also obtainattainable upper bounds on the maximum number of elements in a partitionof a vertex set of a connected graph into geodetic sets, edge geodetic sets,geodetic domin...
متن کاملOn the diameter of the commuting graph of the full matrix ring over the real numbers
In a recent paper C. Miguel proved that the diameter of the commuting graph of the matrix ring $mathrm{M}_n(mathbb{R})$ is equal to $4$ if either $n=3$ or $ngeq5$. But the case $n=4$ remained open, since the diameter could be $4$ or $5$. In this work we close the problem showing that also in this case the diameter is $4$.
متن کامل